Task unrelated thought (TUT) refers to thought directed away from the current situation, for example a daydream. Three experiments were conducted on healthy participants, with two broad aims. First, to contrast distributed and encapsulated views of cognition by comparing the encoding of categorical and random lists of words (Experiments One and Two). Second, to examine the consequences of experiencing TUT during study on the subsequent retrieval of information (Experiments One, Two, and Three). Experiments One and Two demonstrated lower levels of (...) TUT and higher levels of word-fragment completion whilst encoding categorical relative to random stimuli, supporting the role of a distributed resource in the maintenance of TUT. In addition the results of all three experiments suggested that experiencing TUT during study had a measurable effect on subsequent retrieval. TUT was associated with increased frequency of false alarms at retrieval (Experiment One). In the subsequent experiments TUT was associated with no advantage to retrieval based on recollection, by manipulating instructions at encoding (Experiment Two), and/or at retrieval (Experiment Three). The implications of the results of all three experiments are discussed in terms of recent accounts of memory retrieval and conscious awareness. (shrink)

There is a growing literature on the concept of e-trust and on the feasibility and advisability of “trusting” artificial agents. In this paper we present an object-oriented model for thinking about trust in both face-to-face and digitally mediated environments. We review important recent contributions to this literature regarding e-trust in conjunction with presenting our model. We identify three important types of trust interactions and examine trust from the perspective of a software developer. Too often, the primary focus of research in (...) this area has been on the artificial agents and the humans they may encounter after they are deployed. We contend that the humans who design, implement, and deploy the artificial agents are crucial to any discussion of e-trust and to understanding the distinctions among the concepts of trust, e-trust and face-to-face trust. (shrink)

In this essay we argue that the current social and ethical structure in the Open Source Software Community stem from its roots in academia. The individual developers experience a level of autonomy similar to that of a faculty member. Furthermore, we assert that the Open Source Software Community’s social structure demands benevolent leadership. We argue that it is difficult to pass off low quality open source software as high quality software and that the Open Source development model offers strong accountability. (...) Finally, we argue that Open Source Software introduces ethical challenges for universities and the software development community. (shrink)

Three experiments explore the role of working memory in motor skill acquisition and performance. Traditional theories postulate that skill acquisition proceeds through stages of knowing, which are initially declarative but later procedural. The reported experiments challenge that view and support an independent, parallel processing model, which predicts that procedural and declarative knowledge can be acquired separately and that the former does not depend on the availability of working memory, whereas, the latter does. The behaviour of these two processes was manipulated (...) by providing or withholding visual (and auditory) appraisal of outcome feedback. Withholding feedback was predicted to inhibit the use of working memory to appraise success and, thus, prevent the formation of declarative knowledge without affecting the accumulation of procedural knowledge. While the first experiment failed to support these predictions, the second and third experiments demonstrated that procedural and declarative knowledge can be acquired independently. It is suggested that the availability of working memory is crucial to motor performance only when the learner has come to rely on its use. (shrink)

"The Rules" are found in a collaborative document that states principles for responsibility when a computer artifact is designed, developed and deployed into a sociotechnical system. At this writing, over 50 people from nine countries have signed onto The Rules. Unlike codes of ethics, The Rules are not tied to any organization, and computer users as well as computing professionals are invited to sign onto The Rules. The emphasis in The Rules is that both users and professionals have responsibilities in (...) the production and use of computing artifacts. In this paper, we use The Rules to examine issues of trust. (shrink)

We contend that software developers have an ethical responsibility to strive for reliable software. We base that obligation on long standing engineering traditions that place the public good as a central tenant and on the professional relationship between a software developer and the users of the software developed.

There is general acknowledgement that both the anterior cingulate and orbitofrontal cortex are implicated in reinforcement-guided decision making, and emotion and social behaviour. Despite the interest that these areas generate in both the cognitive neuroscience laboratory and the psychiatric clinic, ideas about the distinctive contributions made by each have only recently begun to emerge. This reflects an increasing understanding of the component processes that underlie reinforcement- guided decision making, such as the representation of reinforcement expectations, the exploration, updating and representation (...) of action values, and the appreciation that choices are guided not just by the prospect of reward but also by the costs that action entails. Evidence is emerging to suggest that the anterior cingulate and orbitofrontal cortex make distinct contributions to each of these aspects of decision making. (shrink)

The first main result isolates some conditions which fail for the class of graphs and hold for the class of Abelian p-groups, the class of Abelian torsion groups, and the special class of "rank-homogeneous" trees. We consider these conditions as a possible definition of what it means for a class of structures to have "Ulm type". The result says that there can be no Turing computable embedding of a class not of Ulm type into one of Ulm type. We apply (...) this result to show that there is no Turing computable embedding of the class of graphs into the class of "rank-homogeneous" trees. The second main result says that there is a Turing computable embedding of the class of rank-homogeneous trees into the class of torsion-free Abelian groups. The third main result says that there is a "rank-preserving" Turing computable embedding of the class of rank-homogeneous trees into the class of Boolean algebras. Using this result, we show that there is a computable Boolean algebra of Scott rank ${\mathrm{\omega }}_{1}^{\mathrm{C}\mathrm{K}}$. (shrink)

Shepherdson [14] showed that for a discrete ordered ring I, I is a model of IOpen iff I is an integer part of a real closed ordered field. In this paper, we consider integer parts satisfying PA. We show that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ₄), then R must be recursively saturated. In particular, the real closure of I, RC (I), is recursively saturated. We (...) also show that if R is a countable recursively saturated real closed ordered field, then there is an integer part I such that R = RC(I) and I is a nonstandard model of PA. (shrink)

This collection of essays, addresses, and one interview come from the years 1966-73 and cover a wide spectrum of interest, dealing with such general topics as 'The Absence of God in Modern Culture' and 'The Future of Christianity.'.

Here we prove that if T and T′ are strongly minimal theories, where T′ satisfies a certain property related to triviality and T does not, and T′ is model complete, then there is no computable embedding of Mod(T) into Mod(T′). Using this, we answer a question from [4], showing that there is no computable embedding of VS into ZS, where VS is the class of infinite vector spaces over Q, and ZS is the class of models of Th(Z, S). Similarly, (...) we show that there is no computable embedding of ACF into ZS, where ACF is the class of algebraically closed fields of characteristic 0. (shrink)

In this paper, we give an example of a complete computable infinitary theory T with countable models ${\mathcal{M}}$ and ${\mathcal{N}}$ , where ${\mathcal{N}}$ is a proper computable infinitary extension of ${\mathcal{M}}$ and T has no uncountable model. In fact, ${\mathcal{M}}$ and ${\mathcal{N}}$ are (up to isomorphism) the only models of T. Moreover, for all computable ordinals α, the computable ${\Sigma_\alpha}$ part of T is hyperarithmetical. It follows from a theorem of Gregory (JSL 38:460–470, 1972; Not Am Math Soc 17:967–968, 1970) (...) that if T is a Π 1 1 set of computable infinitary sentences and T has a pair of models ${\mathcal{M}}$ and ${\mathcal{N}}$ , where ${\mathcal{N}}$ is a proper computable infinitary extension of ${\mathcal{M}}$ , then T would have an uncountable model. (shrink)

In 1924, Virginia Woolf wrote a short story based upon the life of Eleanor Ormerod. A wealthy spinster, Ormerod achieved notoriety in late nineteenth-century Britain as an economic entomologist. In 1904, Nature compared her to Caroline Herschel and Mary Somerville. In terms of recent scholarship devoted to the history of women in science, Ormerod's career differed markedly from that of her two predecessors. The emotional or intellectual support of a brother, husband, father, or male family relation made no considerable contribution (...) to her commitment to the study of entomology. Furthermore, her life as an independent spinster offered no positive proof for Francis Power Cobbe's dictum: as she aged, Eleanor Ormerod showed no tendency to become a ‘women's rights woman’. She publicly accepted or internalized the dominant, masculine ideology of science; and by contemporary standards, she achieved success. (shrink)

The Hanf number for a set S of sentences in \ is the least infinite cardinal \ such that for all \, if \ has models in all infinite cardinalities less than \, then it has models of all infinite cardinalities. Friedman asked what is the Hanf number for Scott sentences of computable structures. We show that the value is \. The same argument proves that \ is the Hanf number for Scott sentences of hyperarithmetical structures.